Shared Memory Multistage Clustering Structure: An Efficient Structure for Massively Parallel Processing Systems

نویسندگان

  • H. S. SHAHHOSEINI
  • M. NADERI
  • R. BUYYA
چکیده

In this paper a new structure is proposed for the massive parallel processing systems. This structure is expandable in vertical and horizontal manner and cover many of the previous computer designs. The queuing theory and Jackson queuing network is applied for constructing an analytical model for the proposed structure. This model gives a closed-form solution for the system performance metrics, such as processor’s waiting time, system processing power, and so on. Two novel points in development of these analytical models are: application of open queuing network rules for analyzing a closed queuing network, and calculation of the input rate of each service center as a function of the input rate for previous center. The model can be used for evaluating the MPP system or optimizing its specification on design space.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Svs: Can the Shared Variable Paradigm Exist in Massively Parallel Multiprocessors?

During the last years there have been many eeorts aiming towards the elimination of the gap between Shared Memory and Message Passing multi-processors. Many researchers have addressed the problem by implementing Distributed Shared Memory (DSM) systems. In this paper, we present a solution that is based on the software DSM approach but diierentiates from it, as it focuses on keeping shared varia...

متن کامل

A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

متن کامل

A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

متن کامل

Reducing hot-spot contention in shared-memory multiprocessor systems

In parallel systems it is possible for several processors to request concurrent access to a shared data structure such as a synchronization variable. Such an access pattern causes what is known as hotspot contention. In shared-memory multiprocessor systems that use a multistage interconnection network, hot-spot contention may result in "tree saturation" that degrades the system performance. It ...

متن کامل

Towards Optimal Execution of Density-based Clustering on Heterogeneous Hardware

Data Clustering is an important and highly utilized data mining technique in various application domains. With ever increasing data volumes in the era of big data, the efficient execution of clustering algorithms is a fundamental prerequisite to gain understanding and acquire novel, previously unknown knowledge from data. To establish an efficient execution, the clustering algorithms have to be...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000